Parallel multi-objective multi-robot coalition formation
نویسندگان
چکیده
Consider a system with M robots each having K resource types and N tasks having a vector of Kresource types. A coalition scheme represents a grouping of a given set of robots into disjoint subsets where each subset (coalition ) is assigned one task. Thus for N tasks we have N coalition schemes, represented as CS = {C1, C2,,....CN}, In this problem we have considered the following two conflicting objectives.
منابع مشابه
Multi-Robot Coalition Formation (REGULAR PAPER)
As the community strives towards autonomous multi-robot systems, there is a need for these systems to autonomously form coalitions to complete assigned missions. Numerous coalition formation algorithms have been proposed in the software agent literature. Algorithms exist that form agent coalitions in both super additive and non-super additive environments. The algorithmic techniques vary from n...
متن کاملCoalition Formation: From Software Agents to Robots
A problem that has recently attracted the attention of the research community is the autonomous formation of robot teams to perform complex multirobot tasks. The corresponding problem for software agents is also known in the multi-agent community as the coalition formation problem. Numerous algorithms for software agent coalition formation have been provided that allow for efficient cooperation...
متن کاملMulti-Task Coalition Parallel Formation Strategy Based on Reinforcement Learning
Agent coalition is an important manner of agents’ coordination and cooperation. Forming a coalition, agents can enhance their ability to solve problems and obtain more utility. In this paper, a novel multi-task coalition parallel formation strategy is presented, and the conclusion that the process of multi-task coalition formation is a Markov Decision Process is testified theoretically. Moreove...
متن کاملA Framework for Multi-Robot Coalition Formation
Task allocation is a fundamental problem that any multirobot system must address. Numerous multi-robot task allocation schemes have been proposed over the past decade. A vast majority of these schemes address the problem of assigning a single robot to each task. However as the complexity of multi-robot tasks increases, often situations arise where multiple robot teams need to be assigned to a s...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Expert Syst. Appl.
دوره 42 شماره
صفحات -
تاریخ انتشار 2015